Least - Squares Mirrorsymmetric Solution for Matrix Equations ( AX = B , XC = D )
نویسندگان
چکیده
Matrix equations (AX = B,XC = D) is a class of important matrix equations. The problem of the solution of the matrix equations (AX = B,XC = D) arise in engineering and in some special matrix inverse problems [1-3]. Many authors have been devoted to the study of this problem, and a series of useful results have been obtained. For example, Mitra [4] gave the common solution of minimum possible rank by using generalized inverse of matrix. Chu [5], Mitra [6] presented the necessary and sufficient conditions for the solvability and general solution by using the singular value decomposition (SVD) and generalized inverse of matrix, respectively. When the solution matrix X is constrained and the matrix equations are not consistent, it is necessary to study the least-squares constrained solution of the corresponding matrix equations. The purpose of this paper is to discuss the least-squares mirrorsymmetric solution of the matrix equations (AX = B,XC = D) by using the special structure of mirrorsymmetric matrices. The background for introducing the definition of mirrorsymmetric matrices is to study odd/even-mode decomposition of symmetric multiconductor transmission lines (MTL)[7]. We now introduce some notation. Let R be the set of all n × m real matrices; R r be the set of all matrices in R with rank r, R(A) denote the rank of A; OR denote
منابع مشابه
On the optimal correction of inconsistent matrix equations $AX = B$ and $XC = D$ with orthogonal constraint
This work focuses on the correction of both the coecient and the right hand side matrices of the inconsistent matrix equations $AX = B$ and $XC = D$ with orthogonal constraint. By optimal correction approach, a general representation of the orthogonal solution is obtained. This method is tested on two examples to show that the optimal correction is eective and highly accurate.
متن کاملSolution to a System of Matrix Equations
A square complex matrix A is called if it can be written in the form EP 1 0 U A U with U being fixed unitary and 1 A being arbitrary matrix in . We give necessary and sufficient conditions for the existence of the solution to the system of complex matrix equation r r r EP , AX B XC D and present an expression of the solution to the system when the solvability conditions are satisf...
متن کاملConstrained Solutions of a System of Matrix Equations
We derive the necessary and sufficient conditions of and the expressions for the orthogonal solutions, the symmetric orthogonal solutions, and the skew-symmetric orthogonal solutions of the system of matrix equations AX B and XC D, respectively. When the matrix equations are not consistent, the least squares symmetric orthogonal solutions and the least squares skewsymmetric orthogonal solutions...
متن کاملCramer's Rule for Generalized Inverse Solutions of Some Matrices Equations
By a generalized inverse of a given matrix, we mean a matrix that exists for a larger class of matrices than the nonsingular matrices, that has some of the properties of the usual inverse, and that agrees with inverse when given matrix happens to be nonsingular. In theory, there are many different generalized inverses that exist. We shall consider the Moore Penrose, weighted Moore-Penrose, Draz...
متن کاملA New Method for the Bisymmetric Minimum Norm Solution of the Consistent Matrix Equations A1XB1=C1, A2XB2=C2
A 2 XB 2 = C 2 , there are some valuable efforts on solving a pair of the matrix equations with certain linear constraints on solution. For instance, Khatri and Mitra [7] derived the Hermitian solution of the consistent matrix equations AX = C, XB = D. Deng et al. [8] studied the consistent conditions and the general expressions about the Hermitian solutions of the matrix equations (AX,XB) = (C...
متن کامل